Malcev algebras corresponding to smooth almost left automorphic Moufang loops

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Structure of Free Automorphic Moufang Loops

We describe the structure of a free loop of rank n in the variety of automorphic Moufang loops as a subdirect product of a free group and a free commutative Moufang loop, both of rank n. In particular, the variety of automorphic Moufang loops is the join of the variety of groups and the variety of commutative Moufang loops.

متن کامل

Moufang loops that are almost groups

It is known that Moufang loops are closely related to groups as they have many properties in common. For instance, they both have an inverse for each element and satisfy Lagrange’s theorem. In this paper, we study the properties of a class of Moufang loops which are not groups, but all their proper subloops and proper quotient loops are groups.

متن کامل

Malcev Algebras and Combinatorial Structures

In this work, we design an algorithmic method to associate combinatorial structures with finite-dimensional Malcev algebras. In addition to its theoretical study, we have performed the implementation of procedures to construct the digraph associated with a given Malcev algebra (if its associated combinatorial structure is a digraph) and, conversely, a second procedure to test if a given digraph...

متن کامل

On Moufang A-loops

In a series of papers from the 1940’s and 1950’s, R.H. Bruck and L.J. Paige developed a provocative line of research detailing the similarities between two important classes of loops: the diassociative A-loops and the Moufang loops ([1]). Though they did not publish any classification theorems, in 1958, Bruck’s colleague, J.M. Osborn, managed to show that diassociative, commutative A-loops are ...

متن کامل

Moufang Loops of Small Order

The main result of this paper is the determination of all nonassociative Moufang loops of orders *31. Combinatorial type methods are used to consider a number of cases which lead to the discovery of 13 loops of the type in question and prove that there can be no others. All of the loops found are isomorphic to all of their loop isotopes, are solvable, and satisfy both Lagrange's theorem and Syl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra and Its Applications

سال: 2018

ISSN: 0219-4988,1793-6829

DOI: 10.1142/s0219498818502328